ESTIMATING EXPECTED COMPLETION TIMES WITH PROBABILISTIC JOB ROUTING Nirmal Govind
نویسندگان
چکیده
A common problem in production environments is the need to estimate the remaining time in system for work-inprogress jobs. Simulation can be used to obtain the estimates. However, when the future path of a job is uncertain (due to stochastic events such as rework), using simulation to estimate the remaining cycle time of a job at step k can be imprecise; traditional confidence intervals on the estimated remaining cycle times may be too large to be of practical significance. We propose a response surface methodology-based approach to estimating conditional confidence intervals on the remaining cycle times as jobs progress through the system and more information is obtained on them. This method will provide more useful and accurate estimates of remaining cycle times at various stages of the process flow. Further, we outline two different simulation approaches for estimating the response surfaces used to generate the confidence intervals.
منابع مشابه
Probabilistic Analysis and Practical Algorithms for the Flow Shop Weighted Completion Time Problem
In the flow shop weighted completion time problem, a set of jobs has to be processed on m machines. Every machine has to process each one of the jobs, and every job has the same routing through the machines. The objective is to determine a sequence of the jobs on the machines so as to minimize the sum of the weighted completion times of all jobs on the final machine. In this paper, we present a...
متن کاملFuzzy completion time for alternative stochastic networks
In this paper a network comprising alternative branching nodes with probabilistic outcomes is considered. In other words, network nodes are probabilistic with exclusive-or receiver and exclusive-or emitter. First, an analytical approach is proposed to simplify the structure of network. Then, it is assumed that the duration of activities is positive trapezoidal fuzzy number (TFN). This paper com...
متن کاملEstimating Mean Completion Times of a Fork-Join Barrier Synchronizationy
In simulation studies of parallel processors, it is useful to consider the following abstraction of a parallel program. A job is partitioned into n processes, whose running times are independent random variables X 1 ; : : :; X n. As a measure of performance we consider the normalized job completion time S = maxfX i g= P n i=1 X i. We consider a simple approximation to the expected value of S, v...
متن کاملStatic Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality
We study the problem of scheduling a set of J jobs on M machines with stochastic job processing times when no preemptions are allowed and the weighted sum of expected completion time objective. Our model allows for “unrelated” machines: the distributions of processing times may vary across both jobs and machines. We study static routing policies, which assign (or “route”) each job to a particul...
متن کاملA fair workload allocation policy for heterogeneous systems
We consider a new workload allocation policy addressing fairness for user level performance measures. More specifically the criterion used for optimal workload allocation is the one which minimizes the maximum expected response time at computer systems to which jobs are routed. The policy to attain this criterion is therefore referred to as the min-max policy. It is shown that this optimization...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006